Chebyshev interpolation for nonlinear eigenvalue problems
نویسندگان
چکیده
This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In particular, we focus on eigenvalue problems for which the evaluation of the matrix valued function is computationally expensive. Such problems arise, e.g., from boundary integral formulations of elliptic PDE-eigenvalue problems and typically exclude the use of established nonlinear eigenvalue solvers. Instead, we propose the use of polynomial approximation combined with non-monomial linearizations. Our approach is intended for situations where the eigenvalues of interest are located on the real line or, more generally, on a pre-specified curve in the complex plane. A first-order perturbation analysis for nonlinear eigenvalue problems is performed. Combined with an approximation result for Chebyshev interpolation, this shows exponential convergence of the obtained eigenvalue approximations with respect to the degree of the approximating polynomial. Preliminary numerical experiments demonstrate the viability of the approach in the context of boundary element methods.
منابع مشابه
Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis
Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the standard monomial basis for a larger degree d. The standard way of solving polynomial eigenvalue problems proceeds by linearization, which in...
متن کاملAn Analytical and Numerical Study of the Two-Dimensional Bratu Equation
Bratu's problem, which is the nonlinear eigenvalue equation Au + 2 exp(u)= 0 with u = 0 on the walls of the unit square and 2 as the eigenvalue, is used to develop several themes on applications of Chebyshev pseudospectral methods. The first is the importance of symmett:v: because of invariance under the C 4 rotation group and parity in both x and y, one can slash the size of the basis set by a...
متن کاملComplex Chebyshev Approximation for IIR Digital Filters Based on Eigenvalue Problem
This paper presents an efficient method for designing complex infinite impulse response digital filters in the complex Chebyshev sense. The proposed method is based on the formulation of a generalized eigenvalue problem by using the Remez multiple exchange algorithm. Hence, the filter coefficients can be easily obtained by solving the eigenvalue problem to find the absolute minimum eigenvalue, ...
متن کاملDesign of Nonlinear Observer by Using Chebyshev Interpolation based on Formal Linearization
This paper discusses a design of nonlinear observer by a formal linearization method using an application of Chebyshev Interpolation in order to facilitate processes for synthesizing a nonlinear observer and to improve the precision of linearization. A dynamic nonlinear system is linearized with respect to a linearization function, and a measurement equation is transformed into an augmented lin...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کامل